An Efficient Projected Gradient Method for Convex Constrained Monotone Equations with Applications in Compressive Sensing
نویسندگان
چکیده
منابع مشابه
Efficient Compressive Phase Retrieval with Constrained Sensing Vectors
We propose a new approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on constrained sensing vectors and a two-stage reconstruction method that consists of two standard convex optimization programs that are solved sequentially. Various methods for compre...
متن کاملProvable non-convex projected gradient descent for a class of constrained matrix optimization problems
We consider the minimization of convex loss functions over the set of positive semi-definite(PSD) matrices, that are also norm-constrained. Such criteria appear in quantum state tomographyand phase retrieval applications, among others. However, without careful design, existing methodsquickly run into time and memory bottlenecks, as problem dimensions increase.However, the ma...
متن کاملProjected Reflected Gradient Methods for Monotone Variational Inequalities
This paper is concerned with some new projection methods for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. First, we propose the projected reflected gradient algorithm with a constant stepsize. It is similar to the projected gradient method, namely, the method requires only one projection onto the feasible set and only one value of the ...
متن کاملAn Adaptive Prediction-Correction Method for Solving Large-Scale Nonlinear Systems of Monotone Equations with Applications
and Applied Analysis 3 Lemma 3. Let {x k } and {z k } be any sequence generated by Algorithm 1. Suppose that g is monotone and that the solution set of (1) is not empty, then {x k } and {z k } are both bounded. Furthermore, it holds that lim k→∞ xk − zk = 0, (13) lim k→∞ xk+1 − xk = 0. (14) Proof. From (6), we have ⟨g (z k ) , x k − z k ⟩ = −α k ⟨g (z k ) , d k ⟩ ≥ σα 2 k ...
متن کاملGradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
We consider the problem of minimizing a smooth convex objective function subject to the set of minima of another differentiable convex function. In order to solve this problem, we propose an algorithm which combines the gradient method with a penalization technique. Moreover, we insert in our algorithm an inertial term, which is able to take advantage of the history of the iterates. We show wea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Physics
سال: 2020
ISSN: 2327-4352,2327-4379
DOI: 10.4236/jamp.2020.86077